Optimized Temporal Logic Compilation

نویسندگان

  • Andreas Krebs
  • Jürgen Ruf
چکیده

Verification and validation are the major tasks during the design of digital hardware/software systems. Often more than 70% of the development time is spent for locating and correcting errors in the design. Therefore, many techniques have been developed to support the debugging process. Recently, simulation and test methods have been accompanied by formal methods such as equivalence checking and property checking. However, their industrial applicability is currently restricted to small or medium sized designs or to a specific phase in the design process. Therefore, simulation is still the most commonly applied verification technique. In this paper, we present a method for asserting temporal properties during simulation and also during emulation of hardware prototypes. The properties under verification are efficiently translated into an intermediate language (of a virtual machine). This intermediate representation can then be interpreted during simulation. We may also produce executable checkers running in parallel to the simulation. Furthermore, we are able to translate the properties into synthesizable hardware modules which can then be used during system emulation on FPGA-based emulators or as self test components checking the functionality during the lifetime of the system.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compilation of LTL Goal Formulas into PDDL

Temporally extended goals are used in planning to express safety and maintenance conditions. Linear temporal logic is the language often used to express temporally extended goals. We present a method for compiling LTL goal formulas into Planning Domain Definition Language (PDDL), which is handled by many AI planners. The compilation process first constructs a finite state machine representing a...

متن کامل

Deterministic Compilation of Temporal Safety Properties in Explicit State Model Checking

The translation of temporal logic specifications constitutes an essential step in model checking and a major influence on the efficiency of formal verification via model checking. We devise a new explicit-state translation of Linear Temporal Logic to automata for the class of LTL specifications that describe safety properties, arguably the most used formal specifications in real-world systems. ...

متن کامل

Compilation and Simplification of Temporal Integrity Constraints

The paper presents a novel compilation scheme for temporal integrity constraints and deductive rules expressed in an interval-based rst-order temporal logic. Compilation builds a dependence graph with simpliied forms of the constraints and rules. This permits the compile-time simpliication of the formulae that have to be veriied at run-time, as well as the precomputation of potential implicit u...

متن کامل

Compilation and Simpliication of Temporal Integrity Constraints

The paper presents a novel compilation scheme for temporal integrity constraints and deductive rules expressed in an interval-based rst-order temporal logic. Compilation builds a dependence graph with simpliied forms of the constraints and rules. This permits the compile-time simpliication of the formulae that have to be veriied at run-time, as well as the precomputation of potential implicit u...

متن کامل

Chomicki and Toman : Implementing Temporal Integrity Constraints Using an Active Dbms

|The paper proposes a general architecture for implementing temporal integrity constraints by compiling them into a set of active DBMS rules. The modularity of the design allows easy adaptation to diierent environments. Both diierences in the speciication languages and in the target rule systems can be easily accommodated. The advantages of this architecture are demonstrated on a particular tem...

متن کامل

Implementing Temporal Integrity

|The paper proposes a general architecture for implementing temporal integrity constraints by compiling them into a set of active DBMS rules. The modularity of the design allows easy adaptation to diierent environments. Both diierences in the speciication languages and in the target rule systems can be easily accommodated. The advantages of this architecture are demonstrated on a particular tem...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. UCS

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2003